An optimal path cover algorithm for cographs
نویسندگان
چکیده
منابع مشابه
An optimal parallel matching algorithm for cographs
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...
متن کاملA Time-Optimal Solution for the Path Cover Problem on Cographs
We show that the notoriously difficult problem of finding and reporting the smallest number of vertex-disjoint paths that cover the vertices of a graph can be solved timeand work-optimally for cographs. Our algorithm solves this problem in O(log n) time using n log n processors on the EREW-PRAM for an n-vertex cograph G represented by its cotree.
متن کاملA linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
In this paper,we study a variant of thepath cover problem, namely, the k -fixed-endpoint path cover problem. Given a graph G and a subset T of k vertices of V (G), a k fixed-endpoint path cover of G with respect to T is a set of vertex-disjoint paths P that covers the vertices of G such that the k vertices ofT are all endpoints of the paths inP . The k -fixed-endpoint path cover problem is to f...
متن کاملA Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs
Let G = (V,E) be a graph with vertex set V and edge set E and let T be a subset of V . A terminal path cover PC of G with respect to T is a set of pairwise vertex-disjoint paths of G, such that all vertices of G are visited by exactly one path of PC and all vertices in T are end vertices of paths in PC. The terminal path cover problem is to find a terminal path cover of G of minimum cardinality...
متن کاملAn Optimal Parallel Algorithm for Node Ranking of Cographs
A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A ranking is optimal if the largest rank assigned is the smallest among all rankings. The optimal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1995
ISSN: 0898-1221
DOI: 10.1016/0898-1221(95)00139-p